1 8 M ay 2 01 5 Entailment Among Probabilistic Implications ∗
نویسنده
چکیده
We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is defined in terms of a threshold on a conditional probability of the consequent, given the antecedent: we are dealing with what the data analysis community calls confidence of partial implications or association rules. Existing studies of redundancy among these partial implications have characterized so far only entailment from one premise and entailment from two premises. By exploiting a previously noted alternative view of this entailment in terms of linear programming duality, we characterize exactly the cases of entailment from arbitrary numbers of premises. As a result, we obtain decision algorithms of better complexity; additionally, for each potential case of entailment, we identify a critical confidence threshold and show that it is, actually, intrinsic to each set of premises and antecedent of the conclusion.
منابع مشابه
ar X iv : 1 40 5 . 15 65 v 1 [ cs . L O ] 7 M ay 2 01 4 Tableau vs . Sequent Calculi for Minimal Entailment
In this paper we compare two proof systems for minimal entailment: a tableau system OTAB and a sequent calculus MLK , both developed by Olivetti (1992). Our main result shows that OTAB-proofs can be efficiently translated into MLK -proofs, i.e.,MLK psimulates OTAB . The simulation is technically very involved and answers an open question posed by Olivetti (1992) on the relation between the two ...
متن کاملEfficient Construction of Probabilistic Tree Embeddings
In this paper we describe a simple and efficient algorithm to construct FRT embeddings (optimal probabilistic tree embeddings) on graphs. For a graph with n vertices and m edges the algorithm runs in O(m log n + n log n) time. With the efficient FRT construction, we show that FRT trees are Ramsey partitions with asymptotically tight bound, and we give tighter bounds on coefficient than previous...
متن کاملar X iv : 1 10 5 . 38 75 v 1 [ co nd - m at . su pr - c on ] 19 M ay 2 01 1 Tunnel Spectroscopy of a Proximity Josephson Junction
متن کامل
. pl as m - p h ] 1 4 M ay 2 00 5 Two - fluid tokamak equilibria with reversed magnetic shear and sheared flow 1
X iv :p hy si cs /0 50 51 01 v1 [ ph ys ic s. pl as m -p h] 1 4 M ay 2 00 5 Two-fluid tokamak equilibria with reversed magnetic shear and sheared flow 1 G. Poulipoulis, G. N. Throumoulopoulos, H. Tasso University of Ioannina, Association Euratom Hellenic Republic, Section of Theoretical Physics, GR 451 10 Ioannina, Greece Max-Planck-Institut für Plasmaphysik, Euratom Association, D-85748 Garchi...
متن کاملar X iv : 0 80 5 . 01 58 v 1 [ m at h . FA ] 1 M ay 2 00 8 OPERATOR - VALUED DYADIC BMO SPACES
We consider BMO spaces of operator-valued functions, among them the space of operator-valued functions B which define a bounded paraproduct on L(H). We obtain several equivalent formulations of ‖πB‖ in terms of the norm of the ”sweep” function of B or of averages of the norms of martingales transforms of B in related spaces. Furthermore, we investigate a connection between John-Nirenberg type i...
متن کامل